Intelligent Belief State Sampling for Conformant Planning

نویسندگان

  • Alban Grastien
  • Enrico Scala
چکیده

We propose a new method for conformant planning based on two ideas. First given a small sample of the initial belief state we reduce conformant planning for this sample to a classical planning problem, giving us a candidate solution. Second we exploit regression as a way to compactly represent necessary conditions for such a solution to be valid for the non-deterministic setting. If necessary, we use the resulting formula to extract a counterexample to populate our next sampling. Our experiments show that this approach is competitive on a class of problems that are hard for traditional planners, and also returns generally shorter plans. We are also able to demonstrate unsatisfiability of some problems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Conformant Planning Heuristics Based on Plan Reuse in Belief States

Conformant planning involves generating plans under the condition that the initial situation and action effects are undeterministic and sensing is unavailable during plan execution. (Bonet & Geffner 2000) has shown that conformant planning can be transformed into a search problem in the space of belief states. Since then, heuristic based conformant planning has become a promising approach. Foll...

متن کامل

A New Approach to Conformant Planning Using CNF*

In this paper, we develop a heuristic, progression based conformant planner, called CNF, which represents belief states by a special type of CNF formulae, called CNF-state. We define a transition function ΦCNF for computing the successor belief state resulting from the execution of an action in a belief state and prove that it is sound and complete with respect to the complete semantics defined...

متن کامل

Planning Robust Strategies for Constructing Multi-object Arrangements

A crucial challenge in robotics is achieving reliable results in spite of sensing and control uncertainty. In this work, we explore the conformant planning approach to robot manipulation. In particular, we tackle the problem of pushing multiple objects simultaneously to achieve a specified arrangement without external sensing. Conformant planning is a belief-state planning problem. A belief sta...

متن کامل

Planning in Belief Space with a Labelled Uncertainty Graph

Planning in belief space with a Labelled Uncertainty Graph, LUG, is an approach that uses a very compact planning graph to guide search in the space of belief states to construct conformant and contingent plans. A conformant plan is a plan that transitions (without sensing) all possible initial states through possibly non-deterministic actions to a goal state. A contingent plan adds the ability...

متن کامل

Planning Graph Heuristics for Incomplete and Non-Deterministic Domains

This doctoral work centers on developing domain-independent heuristics for planning problems characterized by state incompleteness and action non-determinism. The key means by which the heuristics are computed is through planning graph analysis. The approach has been used to construct conformant and contingent plans in two different search techniques. The initial focus of the research was inves...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017